TheTrainDesign Optimization Problem regardsmaking optimal decisions on the number and movement of locomotives and crews\nthrough a railway network, so as to satisfy requested pick-up and delivery of car blocks at stations. In amathematical programming\nformulation, the objective function to minimize is composed of the costs associated with the movement of locomotives and cars,\nthe loading/unloading operations, the number of locomotives, and the crews� return to their departure stations. The constraints\ninclude upper bounds for number of car blocks per locomotive, number of car block swaps, and number of locomotives passing\nthrough railroad segments.We propose here a heuristic method to solve this highly combinatorial problem in two steps. The first\none finds an initial, feasible solution by means of an ad hoc algorithm. The second step uses the simulated annealing concept to\nimprove the initial solution, followed by a procedure aiming to further reduce the number of needed locomotives. We show that\nour results are competitive with those found in the literature.
Loading....